-
1 left subtree
левое поддерево
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > left subtree
-
2 left subtree
Большой англо-русский и русско-английский словарь > left subtree
-
3 left subtree
Математика: левое поддерево -
4 left subtree
-
5 left subtree
-
6 left subtree
The New English-Russian Dictionary of Radio-electronics > left subtree
-
7 left subtree
• levo poddrvo -
8 left subtree
мат. -
9 subtree
поддерево (напр. графа)- finite subtree
- left subtree
- maximal subtree
- optimal subtree
- right subtree
- spanning subtree -
10 subtree
поддерево (напр. графа)- finite subtree
- left subtree
- maximal subtree
- optimal subtree
- right subtree
- spanning subtreeThe New English-Russian Dictionary of Radio-electronics > subtree
-
11 левое поддерево
-
12 левое поддерево
Русско-английский словарь по радиоэлектронике > левое поддерево
-
13 levo poddrvo
• left subtree -
14 lijevo podstablo
-
15 левое поддерево
левое поддерево
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Русско-английский словарь нормативно-технической терминологии > левое поддерево
-
16 левое поддерево
left subtree мат.Русско-английский научно-технический словарь Масловского > левое поддерево
-
17 левое поддерево
Большой англо-русский и русско-английский словарь > левое поддерево
-
18 левое поддерево
Mathematics: left subtree
См. также в других словарях:
Left rotation — refers to the following * In an array, moving all items to the next lower location. The first item is moved to the last location, which is now vacant. * In a list, removing the head and inserting it at the tail. Tree Rotation In a binary search… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Sethi-Ullman algorithm — When generating code for arithmetic expressions, the compiler has to decide which is the best way to translate the expression in terms of number of instructions used as well as number of registers needed to evaluate a certain subtree (especially… … Wikipedia
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
AVL tree — In computer science, an AVL tree is a self balancing binary search tree, and it is the first such data structure to be invented. [Robert Sedgewick, Algorithms , Addison Wesley, 1983, ISBN 0 201 06672 6, page 199, chapter 15: Balanced Trees.] In… … Wikipedia
B-tree — In computer science, a B tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. It is most commonly used in databases and filesystems. In B trees, internal (non leaf)… … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia
T-tree — In computer science a T tree is a type of binary tree data structure that is used by main memory databases, such as DataBlitz, e X treme DB, MySQL Cluster, Oracle TimesTen and [http://www.kairosdbms.com Kairos] [http://www.emware.co.kr… … Wikipedia
Leftist tree — A leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node has an s value which is the distance to the nearest leaf. In contrast to a binary heap , a leftist tree attempts to be very unbalanced. In… … Wikipedia
Tree walking automaton — A tree walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings.The following article deals with tree walking automata. For a different notion of tree automaton, closely related to regular tree… … Wikipedia